Optimising Monte Carlo Search Strategies for Automated Pattern Detection by Jeffrey

نویسنده

  • Jeffrey S. Rosenthal
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimising Monte Carlo Search Strategies for Automated Pattern Detection

Automated pattern detection is a well-studied area of computer vision (see e.g. [3], [1], [2], and the references therein), with obvious importance for computer vision and artificial intelligence. Among other things, it presents challenging problems in statistical computation, requiring Monte Carlo and other sophisticated search strategies to efficiently explore large parameter spaces. In this ...

متن کامل

Monte Carlo Simulation to Compare Markovian and Neural Network Models for Reliability Assessment in Multiple AGV Manufacturing System

We compare two approaches for a Markovian model in flexible manufacturing systems (FMSs) using Monte Carlo simulation. The model which is a development of Fazlollahtabar and Saidi-Mehrabad (2013), considers two features of automated flexible manufacturing systems equipped with automated guided vehicle (AGV) namely, the reliability of machines and the reliability of AGVs in a multiple AGV jobsho...

متن کامل

Detection Strategies for Extreme Mass Ratio Inspirals

The capture of compact stellar remnants by galactic black holes provides a unique laboratory for exploring the near horizon geometry of the Kerr spacetime. The gravitational radiation produced by these Extreme Mass Ratio Inspirals (EMRIs) encodes a detailed map of the black hole geometry, and the detection and characterization of these signals is a major science driver for the LISA observatory....

متن کامل

Monte Carlo Connection Prover

Monte Carlo Tree Search (MCTS) is a technique to guide search in a large decision space by taking random samples and evaluating their outcome. In this work, we study MCTS methods in the context of the connection calculus and implement them on top of the leanCoP prover. This includes proposing useful proof-state evaluation heuristics that are learned from previous proofs, and proposing and autom...

متن کامل

A Monte Carlo-Based Search Strategy for Dimensionality Reduction in Performance Tuning Parameters

Redundant and irrelevant features in high dimensional data increase the complexity in underlying mathematical models. It is necessary to conduct pre-processing steps that search for the most relevant features in order to reduce the dimensionality of the data. This study made use of a meta-heuristic search approach which uses lightweight random simulations to balance between the exploitation of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008